Minimisation d'une fonction quasi-convexe aléatoire : applications
نویسنده
چکیده
منابع مشابه
The steepest-ascent method for the linear programming problem
This paver deals with afinite projection method (called the steepest-ascent method) proposée in 1974 by one oj the authors for maximizing a hnear function on a polyhedron In the particular case of the maximizatwn of a piecewise-linear concave function the method simply gives a recently pubhshed algonthm stated in theframework of the nondifferentiable convex optimizatwn Résumé — Ce papier traite...
متن کاملA family of variable metric proximal methods
We consider conceptual optimization methods combining two ideas: the Moreau-Yosida regularization in convex analysis, and quasi-Newton approximations of smooth functions. We outline several approaches based on this combination, and establish their global convergence. Then we study theoretically the local convergence properties of one of these approaches, which uses quasi-Newton updates of the o...
متن کاملProbabilities of hitting a convex hull
In this note, we consider the non-negative least square method with a random matrix. This problem has connections with the probability that the origin is not in the convex hull of many random points. As related problems, suitable estimates are obtained as well on the probability that a small ball does not hit the convex hull. Abstract Dans cette Note nous appliquons la méthode des moindres carr...
متن کاملThe monotonicity of f-vectors of random polytopes
Let K be a compact convex body in R, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fipKnq denote the number of i-dimensional faces of Kn. We show that for planar convex sets, Erf0pKnqs is increasing in n. In dimension d ě 3 we prove that if limnÑ8 Erfd ́1pKnqs An “ 1 for some constants A and c ą 0 then the function n ÞÑ Erfd ́1pKnqs is increasing for n lar...
متن کاملf-vectors of random polytopes
Let K be a compact convex body in R, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fipKnq denote the number of i-dimensional faces of Kn. We show that for planar convex sets, Erf0pKnqs is increasing in n. In dimension d ě 3 we prove that if limnÑ8 Erfd ́1pKnqs An “ 1 for some constants A and c ą 0 then the function n ÞÑ Erfd ́1pKnqs is increasing for n lar...
متن کامل